On Convex Bodies that are Characterizable by Volume Function
نویسندگان
چکیده
منابع مشابه
On Volume Distribution in 2-convex Bodies
We consider convex sets whose modulus of convexity is uniformly quadratic. First, we observe several interesting relations between different positions of such “2-convex” bodies; in particular, the isotropic position is a finite volume-ratio position for these bodies. Second, we prove that high dimensional 2-convex bodies posses one-dimensional marginals that are approximately Gaussian. Third, w...
متن کاملNotes on Cardinals That Are Characterizable by a Complete (Scott) Sentence
Building on [4], [8] and [9] we study which cardinals are characterizable by a Scott sentence, in the sense that φM characterizes κ, if it has a model of size κ, but not of κ. We show that if אα is characterizable by a Scott sentence and β < ω1, then אα+β is characterizable by a Scott sentence. If 0 < γ < ω1, then the same is true for 2אα+γ . Also, אא0 α is characterizable by a Scott sentence. ...
متن کاملNested Convex Bodies are Chaseable
In the Convex Body Chasing problem, we are given an initial point v0 ∈ R and an online sequence of n convex bodies F1, . . . , Fn. When we receive Fi, we are required to move inside Fi. Our goal is to minimize the total distance travelled. This fundamental online problem was first studied by Friedman and Linial (DCG 1993). They proved an Ω( √ d) lower bound on the competitive ratio, and conject...
متن کاملApproximation of convex bodies by inscribed simplices of maximum volume
The Banach-Mazur distance between an arbitrary convex body and a simplex in Euclidean n-space En is at most n+2. We obtain this estimate as an immediate consequence of our theorem which says that for an arbitrary convex body C in En and for any simplex S of maximum volume contained in C the homothetical copy of S with ratio n + 2 and center in the barycenter of S contains C . In general, this r...
متن کاملApproximating the Volume of Convex Bodies
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) and a lower bound V (K) for the volume of a convex set K ⊂ E, the ratio V (K)/V (K) is at least (cd/ log d). Here we describe an algorithm which gives for ǫ > 0 in polynomial time an upper and lower bound with the property V (K)/V (K) ≤ d!(1 + ǫ).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arnold Mathematical Journal
سال: 2020
ISSN: 2199-6792,2199-6806
DOI: 10.1007/s40598-020-00132-0